home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
CU Amiga Super CD-ROM 15
/
CU Amiga Magazine's Super CD-ROM 15 (1997)(EMAP Images)(GB)[!][issue 1997-10].iso
/
CUCD
/
Graphics
/
Ghostscript
/
source
/
shc.c
< prev
next >
Wrap
C/C++ Source or Header
|
1995-06-21
|
2KB
|
70 lines
/* Copyright (C) 1992, 1995 Aladdin Enterprises. All rights reserved.
This file is part of Aladdin Ghostscript.
Aladdin Ghostscript is distributed with NO WARRANTY OF ANY KIND. No author
or distributor accepts any responsibility for the consequences of using it,
or for whether it serves any particular purpose or works at all, unless he
or she says so in writing. Refer to the Aladdin Ghostscript Free Public
License (the "License") for full details.
Every copy of Aladdin Ghostscript must include a copy of the License,
normally in a plain ASCII text file named PUBLIC. The License grants you
the right to copy, modify and redistribute Aladdin Ghostscript, but only
under certain conditions described in the License. Among other things, the
License requires that the copyright notice and this notice be preserved on
all copies.
*/
/* shc.c */
/* Support code for shc.h */
#include "std.h"
#include "scommon.h"
#include "shc.h"
/* ------ Encoding ------ */
/* Empty the 1-word buffer onto the output stream. */
/* q has already been incremented. */
void
hc_put_code_proc(bool reverse_bits, byte *q, uint cw)
{
#define cb(n) ((byte)(cw >> (n * 8)))
if ( reverse_bits )
{
#if hc_bits_size > 16
q[-3] = byte_reverse_bits[cb(3)];
q[-2] = byte_reverse_bits[cb(2)];
#endif
q[-1] = byte_reverse_bits[cb(1)];
q[0] = byte_reverse_bits[cb(0)];
}
else
{
#if hc_bits_size > 16
q[-3] = cb(3);
q[-2] = cb(2);
#endif
q[-1] = cb(1);
q[0] = cb(0);
}
#undef cb
}
/* Put out any final bytes. */
/* Note that this does a store_state, but not a load_state. */
byte *
hc_put_last_bits_proc(stream_hc_state *ss, byte *q, uint bits, int bits_left)
{ while ( bits_left < hc_bits_size )
{ byte c = (byte)(bits >> (hc_bits_size - 8));
if ( ss->FirstBitLowOrder )
c = byte_reverse_bits[c];
*++q = c;
bits <<= 8;
bits_left += 8;
}
ss->bits = bits;
ss->bits_left = bits_left;
return q;
}